New evolutionary search for long low autocorrelation binary sequences

Exhaustive Search for Low Autocorrelation Binary Sequences

Binary sequences with low autocorrelations are important in communication engineering and in statistical mechanics as groundstates of the Bernasconimodel. Computer searches are the main tool to construct such sequences. Due to the exponential size O(2 ) of the configuration space, exhaustive searches are limited to short sequences. We discuss an exhaustive search algorithm with run time charact...

Evolutionary search for low autocorrelated binary sequences

| The search for low autocorrelated binary sequences is a classical example of a discrete frustrated optimization problem. We demonstrate the eeciency of a class of evolutionary algorithms to tackle the problem. A suitable mutation operator using a preselection scheme is constructed and the optimal parameters of the strategy are determined.

New Constructions of Binary Interleaved Sequences with Low Autocorrelation

The autocorrelation of a key stream sequence in a stream cipher is an important cryptographic property. This paper proposes two constructions of binary interleaved sequences of period 4N by selecting appropriate shift sequences, subsequences and complement sequences. And the autocorrelation functions of new sequences are given. The results show that these sequences have low autocorrelation unde...

Improved Branch-and-Bound for Low Autocorrelation Binary Sequences

The Low Autocorrelation Binary Sequence problem has applications in telecommunications, is of theoretical interest to physicists, and has inspired work by many optimisation researchers because of its difficulty. For many years it was considered unsuitable for solution by metaheuristics because of its search space topology, but in recent years metaheuristics have found long high-quality sequence...

Binary sequences with optimal autocorrelation